Joint Timing Synchronization and Decoding of Turbo Codes in AWGN

نویسندگان

  • Bartosz Mielczarek
  • Arne Svensson
چکیده

This paper presents the behaviour of a turbo coding scheme when the synchronization parameters are not perfectly known. The algorithm for timing synchronization together with the theoretical Cramer Rao bound and NDA ML synchronizer are presented. It is shown that synchronization can be achieved using soft bit output of the turbo decoder without the need of using complex separate synchronizers prior to feeding the signal to the turbo decoder.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Synchronization and Decoding Exploiting the Turbo Principle

This paper investigates turbo methods for joint synchronization and decoding in pulse amplitude modulated (PAM) systems. We begin with a brief review of the turbo principle before applying it to the synchronization problem. Specifically, we propose and investigate a baud timing offset synchronization algorithm for error control coded systems. Unlike many previously proposed algorithms, which fe...

متن کامل

Timing Synchronization with Turbo Codes on AWGN Chan- nels

This paper presents the behaviour of a turbo coding scheme when the symbol timing is not perfectly known. The algorithm for timing synchronization together with the theoretical Cramer Rao bound and the performance of an NDA ML synchronizer are presented. It is shown that synchronization can be achieved using the soft bit outputs of the turbo decoder without the need of using complex separate sy...

متن کامل

Code-aided Phase and Timing Ambiguity Resolution for AWGN Channels

We present a novel maximum-likelihood (ML) joint frame synchronization and carrier phase ambiguity resolution algorithm for coded systems that exploits the code properties by accepting soft information from the MAP decoder. Simulation results are presented for turbo codes, and are compared to performance results of a conventional algorithm that does not use the code properties. We show that cod...

متن کامل

Iterative APPA Symbol Timing Recovery for Turbo-coded Systems

This paper examines the problem of symbol timing recovery and decoding in turbo-coded systems. The large coding gain of Turbo-codes enables reliable communications at very low signal-to-noise ratio (SNR). However, the application of turbo coding exacerbates the problem of timing recovery due to its very low operating SNRs. Therefore we propose a new concept: ‘apriori probability aided’ symbol t...

متن کامل

Timing error recovery in turbo-coded systems on AWGN channels

The classical method for decoding turbo codes is the Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm which, in the majority of existing papers, is analyzed under the assumption of perfect channel knowledge and synchronization. In reality, however, its properties change significantly when synchronization is not ideal. In this paper, we show that the influence of timing synchronization offset can be mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998